Revised GRASP with path-relinking for the linear ordering problem
نویسندگان
چکیده
W. Art Chaovalitwongse Department of Industrial and Systems Engineering, Rutgers University 96 Frelinghuysen Rd., Piscataway, New Jersey 08854, USA [email protected] Carlos A.S. Oliveira Princeton Consultants Inc. 2 Research Way, Princeton, NJ 08540 [email protected] Bruno Chiarini PO Box 522274, Miami, FL 33152. [email protected] Panos M. Pardalos Department of Industrial and Systems Engineering, University of Florida 303 Weil Hall, Gainesville, Florida 32601, USA [email protected] Mauricio G.C. Resende AT&T Research Labs 180 Park Avenue, Florham Park, New Jersey 07932, USA [email protected]
منابع مشابه
Hybrid GRASP with Composite Local Search And Path-Relinking for the Linear Ordering Problem with Cumulative Costs
In this paper a GRASP algorithm hybridized with a composite local search and path-relinking is proposed to solve the linear ordering problem with cumulative costs. Our approach consists on adding a composite local search that helps to produce diverse good solutions and improve them trough a truncated path-relinking with local search. The computational results show that the GRASP algorithm finds...
متن کاملMetaheuristics for the linear ordering problem with cumulative costs
The linear ordering problem with cumulative costs (LOPCC) is a variant of the well-known linear ordering problem, in which a cumulative propagation makes the objective function highly non-linear. The LOPCC has been recently introduced in the context of mobile-phone telecommunications. In this paper we propose two metaheuristic methods for this NP-hard problem. The first one is based on the GRAS...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملGRASP and path relinking for the max-min diversity problem
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in the social and biol...
متن کاملGrasp with Evolutionary Path-relinking
We propose GRASP with evolutionary path-relinking, a metaheuristic resulting from the hybridization of GRASP, path-relinking, and evolutionary path-relinking. This metaheuristic is applied to a network migration problem. Experiments show that a GRASP with evolutionary path-relinking heuristic finds solutions faster than a heuristic based on GRASP with path-relinking as well as one based on pure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 22 شماره
صفحات -
تاریخ انتشار 2011